Spectrum Analysis for Turbulence and Induced Accelerations
نویسندگان
چکیده
منابع مشابه
Analysis of Pseudo-Turbulence Flow Induced by Bubble Periodic Formation in Non-Newtonian Fluids
Laser Doppler Velocimetry (LDV) has been employed to determine pseudo-turbulence characteristics of the flow field around bubble train forming in non-Newtonian caboxymethylcellulose (CMC) aqueous solution at low gas flow rate condition. The Reynolds stress and turbulent intensity of the liquid were investigated by means of Reynolds time-averaged method. The experimental results show that ax...
متن کاملRandom Taylor hypothesis and the behavior of local and convective accelerations in isotropic turbulence
The properties of acceleration fluctuations in isotropic turbulence are studied in direct numerical simulations ~DNS! by decomposing the acceleration as the sum of local and convective contributions ~aL5]u/]t and aC5u•1u!, or alternatively as the sum of irrotational and solenoidal contributions @aI521(p/r) and aS5n1 u#. The main emphasis is on the nature of the mutual cancellation between aL an...
متن کاملEnergy spectrum of quasigeostrophic turbulence.
We consider the energy spectrum of a quasigeostrophic model of forced, rotating turbulent flow. We provide a rigorous a priori bound E(k)<or=Ck(-2) valid for wave numbers that are smaller than a wave number associated with the forcing injection scale. This upper bound separates this spectrum from the Kolmogorov-Kraichnan k(-5/3) energy spectrum that is expected in a two-dimensional Navier-Stoke...
متن کاملSpectrum of weak magnetohydrodynamic turbulence.
Turbulence of magnetohydrodynamic waves in nature and in the laboratory is generally cross-helical or nonbalanced, in that the energies of Alfvén waves moving in opposite directions along the guide magnetic field are unequal. Based on high-resolution numerical simulations it is proposed that such turbulence spontaneously generates a condensate of the residual energy E(v) - E(b) at small field-p...
متن کاملAccelerations for Graph Isomorphism
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two graphs in polynomial time O(n). Second, without that conjecture, we prove the algorithm to be of quasi-polynomial time O(n ). The conjectures in this paper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF THE JAPAN SOCIETY FOR AERONAUTICAL AND SPACE SCIENCES
سال: 2008
ISSN: 1344-6460
DOI: 10.2322/jjsass.56.293